Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
نویسندگان
چکیده
منابع مشابه
Scheduling with common due date, earliness and tardiness penalties for multimachine problems: A survey
The just-in-time production philosophy has led to a growing interest in scheduling problems considering both earliness and tardiness penalties. Most publications considering these so-called non-regular objective functions are devoted to single machine problems. In the case of multi-machine problems, there are some papers dealing with parallel machine problems. However, for multi-operation sched...
متن کاملCommon due date scheduling problem with separate earliness and tardiness penalties
This paper considers the problem of linding an optimal schedule and a common due date for a set of jobs, in a static single machine system. The scheduling criterion is the minimization of the weighted sum of earliness and tardiness values. Different weights are considered as the earliness penalty and tardiness penalty, for each job. A branching procedure is presented for finding an optimal solu...
متن کاملHeuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs
W e consider multimachine scheduling problems with earliness and tardiness costs. We first analyze problems in which the cost of a job is given by a general nondecreasing, convex function F of the absolute deviation of its completion time from a (common) unrestrictive duedate, and the objective is to minimize the sum of the costs incurred for all N jobs. (A special case to which considerable at...
متن کاملSingle Machine Common Due Date with Job Dependent Earliness and Tardiness Penalties Problem Using Neural Network
We consider the problem of scheduling of n jobs to minimize the total earliness and tardiness penalty. The scheduling objective is to minimize the sum of job dependent earliness and tardiness penalties.. After determining the scheduling for single machine common due date, using neural network, the result shows that the neural network solution performs very well.
متن کاملEarliness/tardiness scheduling with a common due date and family setups
We examine the problem of scheduling jobs, on a single processor to minimise the total earliness and tardiness costs about a common due date. Jobs belong to mutually exclusive families and a sequence independent setup task is required when processing switches from a job of one family to a job of another. We extend earlier results to obtain necessary optimal conditions for this problem. These ar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2004
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2003.05.019